The harmonic mean formula for probabilities of unions: applications to sparse random graphs
نویسندگان
چکیده
منابع مشابه
Probabilities of Sentences about Very Sparse Random Graphs
W e consider random graphs with edge probability Pn-Q, where n is the number of vertices of the graph, /3 > 0 is fixed, and a = 1 or a = (I + 1)/1 for some fixed positive integer I . We prove that for every firstorder sentence, the probability that the sentence is true for the random graph has an asymptotic limit. Also, there is an eflective procedure for generating the value of the limit in cl...
متن کاملLimit Probabilities for Random Sparse Bit Strings
Let n be a positive integer, c a real positive constant, and p(n) = c/n. Let Un,p be the random unary predicate under the linear order, and Sc the almost sure theory of Un, c n . We show that for every first-order sentence φ: fφ(c) = lim n→∞Pr[Un, c n has property φ] is an infinitely differentiable function. Further, let S = ⋂ c Sc be the set of all sentences that are true in every almost sure ...
متن کاملBisecting sparse random graphs
Consider partitions of the vertex set of a graph G into two sets with sizes differing by at most 1: the bisection width of G is the minimum over all such partitions of the number of ‘‘cross edges’’ between the parts. We are interested in sparse random graphs Ž . G with edge probability c n. We show that, if c ln 4, then the bisection width is n n, c n with high probability; while if c ln 4, the...
متن کاملSparse Quasi-Random Graphs
Quasi-random graph properties form a large equivalence class of graph properties which are all shared by random graphs. In recent years, various aspects of these properties have been treated by a number of authors (e.g., see [5]-[14], [16], [23]-[27]). Almost all of these results deal with dense graphs, that is, graphs on n vertices having cn edges for some c > 0 as n → ∞. In this paper, we ext...
متن کاملDismantling Sparse Random Graphs
We consider the number of vertices that must be removed from a graph G in order that the remaining subgraph has no component with more than k vertices. Our principal observation is that, if G is a sparse random graph or a random regular graph on n vertices with n→∞, then the number in question is essentially the same for all values of k that satisfy both k →∞ and k = o(n). The process of removi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1989
ISSN: 0012-365X
DOI: 10.1016/0012-365x(89)90316-6